github.com/klauspost/compress/huff0.nodeElt.count (method)

13 uses

	github.com/klauspost/compress/huff0 (current package)
		compress.go#L479: 	for huffNode[nonNullRank].count() == 0 {
		compress.go#L486: 	huffNode[nodeNb].setCount(huffNode[lowS].count() + huffNode[lowS-1].count())
		compress.go#L500: 		if huffNode0[lowS+1].count() < huffNode0[lowN+1].count() {
		compress.go#L507: 		if huffNode0[lowS+1].count() < huffNode0[lowN+1].count() {
		compress.go#L515: 		huffNode[nodeNb].setCount(huffNode0[n1+1].count() + huffNode0[n2+1].count())
		compress.go#L600: 		for pos > rank[r].base && c > prev.count() {
		compress.go#L672: 				highTotal := huffNode[highPos].count()
		compress.go#L673: 				lowTotal := 2 * huffNode[lowPos].count()
		compress.go#L735: func (e *nodeElt) count() uint32  { return uint32(*e) }